Robust flight-to-gate assignment with landside capacity constraints
نویسندگان
چکیده
At the interface between airport airside and landside operations, assignment of flights to gates is key ensure efficient operations a high quality service for passengers. We propose mixed-integer linear program an integrated flight-to-gate that considers both as well constraints on capabilities facilities such check-in, security or transfer handle Moreover, our robust in it constrains probability multiple being assigned same gate. Having obtained integrated, assignment, we analyse associated at facilities. Overall, model supports design robust, airside-landside airport.
منابع مشابه
Robust Quadratic Assignment Problem with Uncertain Locations
We consider a generalization of the classical quadratic assignment problem, where coordinates of locations are uncertain and only upper and lower bounds are known for each coordinate. We develop a mixed integer linear programming model as a robust counterpart of the proposed uncertain model. A key challenge is that, since the uncertain model involves nonlinear objective function of the ...
متن کاملSolving the flight gate assignment problem using dynamic programming
This paper considers the problem of assigning flights to airport gates—a problem which is NP-hard in general. We focus on a special case in which the maximization of flight/gate preference scores is the only objective. We show that for a variable number of flights and gates, this problem is still NP-hard. For a fixed number of gates, we present a dynamic programming approach that solves the fli...
متن کاملOligopoly with Capacity Constraints and Thresholds
Abstract Extended Oligopoly models will be introduced and examined in which the firms might face capacity limits, thresholds for minimal and maximal moves, and antitrust thresholds in the case of partial cooperation. Similar situation occurs when there is an additional cost of output adjustment, which is discontinuous at zero due to set-up costs. In these cases the payoff functions of the...
متن کاملRobust capacity assignment solutions for telecommunications networks with uncertain demands
We consider the capacity planning of telecommunications networks with linear investment costs and uncertain future traffic demands. Transmission capacities must be large enough to meet, with a high quality of service, the range of possible demands, after adequate routings of the traffic on the created network. We use the robust optimization methodology to balance the need for a given quality of...
متن کاملFlight Gate Allocation: Modells, Methods and Robust Solutions
We consider the problem of assigning flights to airport gates. We examine the general case in which an aircraft serving a flight may be assigned to different gates for arrival and departure processing and for optional intermediate parking. Restrictions to this assignment include gate closures and shadow restrictions, i. e. the situation where certain gate assignments may cause blocking of neigh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Planning and Technology
سال: 2021
ISSN: ['0308-1060', '1029-0354', '1026-7840']
DOI: https://doi.org/10.1080/03081060.2021.1919347